Yet Another Application of Inference in Computational Linguistics

نویسندگان

  • IGOR A. BOLSHAKOV
  • ALEXANDER GELBUKH
چکیده

Texts in natural languages consist of words that are syntactically linked and semantically combinable—like political party, pay attention, or brick wall. Such semantically plausible combinations of two content words, which we hereafter refer to as collocations, are important knowledge in many areas of computational linguistics. We consider a lexical resource that provides such knowledge—a collocation database (CBD). Since such databases cannot be complete under any reasonable compilation procedure, we consider heuristic-based inference mechanisms that predict new plausible collocations based on the ones present in the CDB, with the help of a WordNet-like thesaurus. If A B is an available collocation and B is ‘similar’ to C, then A C is supposedly a collocation of the same category. Also, we touch upon semantically induced morphological categories suiting for such inferences. Several heuristics for filtering out wrong hypotheses are also given and the experience in inferences obtained with CrossLexica CDB is briefly discussed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extending the Qualitative Trajectory Calculus Based on the Concept of Accessibility of Moving Objects in the Paths

Qualitative spatial representation and reasoning are among the important capabilities in intelligent geospatial information system development. Although a large contribution to the study of moving objects has been attributed to the quantitative use and analysis of data, such calculations are ineffective when there is little inaccurate data on position and geometry or when explicitly explaining ...

متن کامل

Identifying linguistic knowledge for textual inference

The ability to recognize whether one text can be inferred from another is a critical element of various computational linguistics tasks. The current work explores what kind of linguistic information is useful, or even necessary, in making such inference judgments and how well an inference model using minimal representation and linguistic information performs on an inference judgment task.

متن کامل

0d[lpxppsduvlprq\\phwkrgglqqwkhhvxejurxslqjjrii'udylgldqq Odqjxdjhvvv ,qwurgxfwlrqqq 6xejurxslqjjrii'udylgldqqodqjxdjhvvv

Historical linguistics has as one of its main aims, the classification of languages into language families. The internal classification of languages within a language family is known as subgrouping. Subgrouping is concerned with the way daughter languages within a single family are related to one another and therefore, with the branching structure of the family tree (Campbell 2003). In recent y...

متن کامل

Yet Another Application of the Theory of ODE in the Theory of Vector Fields

In this paper we are supposed to define the θ−vector field on the n−surface S and then investigate about the existence and uniqueness of its integral curves by the Theory of Ordinary Differential Equations. Then thesubject is followed through some examples.

متن کامل

On Structural Inference for XML Data

Semistructured data presents many challenges, mainly due to its lack of a strict schema. These challenges are further magnified when large amounts of data are gathered from heterogeneous sources. We address this by investigation and development of methods to automatically infer structural information from example data. Using XML as a reference format, we approach the schema generation problem b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006